HAMILTON PATHS IN TOURNAMENTS AND A PROBLEM OF McMULLEN ON PROJECTIVE TRANSFORMATIONS IN R
نویسنده
چکیده
An upper bound for McMullen's problem on projective transformations in R is derived from Redei's classical theorem on Hamilton paths in tournaments.
منابع مشابه
Hardness of subgraph and supergraph problems in c-tournaments
Problems like the directed feedback vertex set problem have much better algorithms in tournaments when compared to general graphs. This motivates us to study a natural generalization of tournaments, named c-tournaments, and see if the structural properties of these graphs are helpful in obtaining similar algorithms. c-tournaments are simple digraphs which have directed paths of length at most c...
متن کامل10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope
Here admissible means that none of the n points is sent to infinity by the projective transformation. For dimension two and three the numbers f (d) are known: f (2) = 5 and f (3) = 7. For d ≥ 2, Larman has established in [6] the bounds 2d + 1 ≤ f (d) ≤ (d + 1)2, and conjectured that f (d) = 2d + 1. The upper bound has been improved to f (d) ≤ (d + 1)(d + 2)/2 by Las Vergnas [7], as a corollary ...
متن کاملHamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments
A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n− 1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n. In fact, we prove a far more general result, based on our recent concept of robust expansion and a new method for decomposing graphs. We show that every sufficiently large regular digraph G on n vertices whose...
متن کاملDirected paths: from Ramsey to Ruzsa and Szemeredi
Starting from an innocent Ramsey-theoretic question regarding directed paths in tournaments, we discover a series of rich and surprising connections that lead into the theory around a fundamental problem in Combinatorics: the Ruzsa-Szemerédi induced matching problem. Using these relationships, we prove that every coloring of the edges of the transitive n-vertex tournament using three colors con...
متن کاملAbsorbent sets and kernels by monochromatic directed paths in m-colored tournaments
In this paper, we consider the following problem due to Erdős: for each m ∈ N, is there a (least) positive integer f(m) so that every finite mcolored tournament contains an absorbent set S by monochromatic directed paths of f(m) vertices? In particular, is f(3) = 3? We prove several bounds for absorbent sets of m-colored tournaments under certain conditions on the number of colors of the arcs i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986